Trade-off for Heterogeneous Distributed Storage Systems between Storage and Repair Cost

We consider heterogeneous distributed storage systems (DSSs) having flexible reconstruction degree, where each node in the system has nonuniform repair bandwidth and capacity. In particular, a data collector can reconstruct file using some $$k$$ nodes and, for failure, be repaired by set of active nodes. Using min-cut bound, we investigate fundamental trade-off between costs our model DSS. Further, problem is formulated as bi-objective optimization linear programing various DSSs. For DSSs, it shown that calculated bound tight.